- empty clause
- мат.пустой дизъюнкт
English-Russian scientific dictionary. 2008.
empty clause
Смотреть что такое "empty clause" в других словарях:
Clause (logic) — For other uses, see Clause (disambiguation). In logic, a clause is a finite disjunction of literals.[1] Clauses are usually written as follows, where the symbols li are literals: In some cases, clauses are written (or defined) as sets of literals … Wikipedia
Clause De Horn — Pour les articles homonymes, voir Horn. La dénomination « clause de Horn » vient du nom du logicien Alfred Horn qui, le premier, met en évidence l’intérêt de telles clauses en 1951 dans l’article « On sentences which are true of… … Wikipédia en Français
Clause de horn — Pour les articles homonymes, voir Horn. La dénomination « clause de Horn » vient du nom du logicien Alfred Horn qui, le premier, met en évidence l’intérêt de telles clauses en 1951 dans l’article « On sentences which are true of… … Wikipédia en Français
Clause de Horn — Pour les articles homonymes, voir Horn. En logique, en particulier en calcul propositionnel, une clause de Horn est une clause comportant au plus un littéral positif. Il existe donc trois types de clauses de Horn : celles qui comportent un… … Wikipédia en Français
Empty category principle — In linguistics, the empty category principle (ECP) was proposed in Noam Chomsky s syntactic framework of government and binding theory. The ECP is supposed to be a universal syntactic constraint that requires traces to be properly governed.Proper … Wikipedia
SLD resolution — ( Selective Linear Definite clause resolution) is the basic inference rule used in logic programming. It is a refinement of resolution, which is both sound and refutation complete for Horn clauses. The SLD inference ruleGiven a goal clause: eg L… … Wikipedia
Resolution (logic) — In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem proving technique for sentences in propositional logic and first order logic. In other words, iteratively applying the… … Wikipedia
DPLL algorithm — The Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking based algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF SAT problem. It was introduced in … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Null (SQL) — The Greek lowercase omega (ω) character is used to represent Null in database theory. Null is a special marker used in Structured Query Language (SQL) to indicate that a data value does not exist in the database. Introduced by the creator of the… … Wikipedia
Complementizer — In linguistics (especially generative grammar), a complementizer (or complementiser) is a syntactic category (part of speech) roughly equivalent to the term subordinating conjunction in traditional grammar. For example, the word that is generally … Wikipedia
